Simplicial edge representation of protein structures and alpha contact potential with confidence measure.

نویسندگان

  • Xiang Li
  • Changyu Hu
  • Jie Liang
چکیده

Protein representation and potential function are two important ingredients for studying protein folding, equilibrium thermodynamics, and sequence design. We introduce a novel geometric representation of protein contact interactions using the edge simplices from the alpha shape of the protein structure. This representation can eliminate implausible neighbors that are not in physical contact, and can avoid spurious contact between two residues when a third residue is between them. We developed statistical alpha contact potential using an odds-ratio model. A studentized bootstrap method was then introduced to assess the 95% confidence intervals for each of the 210 propensity parameters. We found, with confidence, that there is significant long-range propensity (>30 residues apart) for hydrophobic interactions. We tested alpha contact potential for native structure discrimination using several sets of decoy structures, and found that it often performs comparably with atom-based potentials requiring many more parameters. We also show that accurate geometric representation is important, and that alpha contact potential has better performance than potential defined by cutoff distance between geometric centers of side chains. Hierarchical clustering of alpha contact potentials reveals natural grouping of residues. To explore the relationship between shape and physicochemical representations, we tested the minimum alphabet size necessary for native structure discrimination. We found that there is no significant difference in performance of discrimination when alphabet size varies from 7 to 20, if geometry is represented accurately by alpha simplicial edges. This result suggests that the geometry of packing plays an important role, but the specific residue types are often interchangeable.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vertex Decomposable Simplicial Complexes Associated to Path Graphs

Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...

متن کامل

Geometric structures on negatively curved groups and their subgroups

In this thesis, we investigate two explicit families of geometric structures that occur on hyperbolic groups. After recalling some introductory material, we begin by giving an overview of the theory of special cube complexes, with a particular focus on properties of subgroups of hyperbolic special groups. We then describe an explicit algorithm, based on Stallings’ notion of folding for graphs, ...

متن کامل

سنجش کیفیت خدمات براساس انتظارات و ادراک بیماران در بیمارستان های زنجان

Measuring of service quality is the basic prerequisite for improving quality. Patients;apos expectations and perceptions of service quality play an important role in the choice of hospital, loyalty to organization and behavioral intention. A first step towards improvement would be to determine areas of quality that are most defective. Studies show that consumers are in close contact with servic...

متن کامل

A Representation of Image Structure and Its Application to Object Selection Using Freehand Sketches

We present an algorithm for computing a representation of image structure, or image segmentation, and use itfor selecting objects in the image with freehand sketches drawn by the user over the image. The sketches are mapped onto image segments whose union forms the intended object. The mapping operation is performed with the aid of a simplicial decomposition of the image segmentation a triangul...

متن کامل

Finite groups admitting a connected cubic integral bi-Cayley graph

A graph   is called integral if all eigenvalues of its adjacency matrix  are integers.  Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$.  In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Proteins

دوره 53 4  شماره 

صفحات  -

تاریخ انتشار 2003